Higher-Order Automated Theorem Proving
نویسنده
چکیده
The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since it has to take the theory of αβη-equality into account. As a consequence, the higher-order unification problem is undecidable and sets of solutions need not even always have most general elements that represent them. Thus the mentioned calculi for higher-order logic have take special measures to circumvent the problems posed by the theoretical complexity of higher-order unification. In this paper, we will exemplify the methods and proofand model-theoretic tools needed for extending first-order automated theorem proving to higherorder logic. For the sake of simplicity take the tableau method as a basis (for a general introduction to first-order tableaux see part I.1) and discuss the higherorder tableau calculi HT and HTE first presented in [19]. The methods in this paper also apply to higher-order resolution calculi [1, 13, 6] or the higher-order matings method of Peter [3], which extend their first-order counterparts in much the same way. Since higher-order calculi cannot be complete for the standard semantics by Gödel’s incompleteness theorem [11], only the weaker notion of Henkin models [12] leads to a meaningful notion of completeness in higher-order logic. It turns out that the calculi in [1, 13, 3, 19] are not Henkin-complete, since they fail to capture the extensionality principles of higher-order logic. We will characterize the deductive power of our calculus HT (which is roughly equivalent to these calculi) by the semantics of functional Σ-models. To arrive at a calculus that is complete with respect to Henkin models, we build on ideas from [6] and augment HT with tableau construction rules that use the extensionality principles in a goal-oriented way.
منابع مشابه
Higher - Order Automated Theorem Proving for NaturalLanguage
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order uniication (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
متن کاملAutomated Higher-order Reasoning in Quantales
We present an approach to bring reasoning in quantales into the realm of automated theorem proving. We use the TPTP Problem Library for this purpose which by a recent approach now integrates fully automated higher-order theorem provers. In particular, we give an encoding of quantales in the new typed higher-order form and show how to prove theorems about quantales fully automatically.
متن کاملHigher-Order Automated Theorem Proving for Natural Language Semantics
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order unii-cation (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
متن کاملAutomated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory
Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations of type theory, it simulates exactly higherorder resolution. In this note, we compare how it behaves on type theory and on set theory. Higher-order theorem pr...
متن کاملUnderstanding LEO-II's proofs
The Leo and Leo-II provers have pioneered the integration of higher-order and firstorder automated theorem-proving. To date, the Leo-II system is, to our knowledge, the only automated higher-order theorem-prover which is capable of generating joint higherorder–first-order proof objects in TPTP format. This paper discusses Leo-II’s proof objects. The target audience are practitioners with an int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998